The Eigenfunction of the Reed-Muller Transformation
نویسندگان
چکیده
We introduce eigenfunctions of the Reed-Muller transform. Eigenfunctions are functions whose canonical sumof-products expression and PPRM (positive polarity ReedMuller expression) are isomorphic. In the case of symmetric functions, the eigenfunction can be viewed as a function whose reduced truth vector is identical to the reduced ReedMuller spectrum. We show that the number of symmetric (ordinary) eigenfunctions on -variables is ( ). We identify three special symmetric functions that correspond to the most complicated minimal fixed polarity ReedMuller (FPRM) form. We show how the transeunt triangle can be used to convert between the reduced (ordinary) truth vector and the reduced (ordinary) Reed-Muller spectrum. We derive the number of products in the FPRM for these symmetric functions: this shows that they have the most complicated minimal FPRM among all -variable functions. 1 AND-EXOR Expressions In this part, we define some classes of AND-EXOR expressions. Theorem 1.1 An arbitrary logic function can be expanded as
منابع مشابه
Steganography Scheme Based on Reed-Muller Code with Improving Payload and Ability to Retrieval of Destroyed Data for Digital Images
In this paper, a new steganography scheme with high embedding payload and good visual quality is presented. Before embedding process, secret information is encoded as block using Reed-Muller error correction code. After data encoding and embedding into the low-order bits of host image, modulus function is used to increase visual quality of stego image. Since the proposed method is able to embed...
متن کاملRun-Length Properties of A Reed-Muller RM(1,m) Code with Applications in Channels With at Most One Synchronization Error
In this report we analyze the performance of a Reed-Muller(1,m) code in channels where at most one synchronization error, viewed as either a repetition or a deletion of a bit, occurs. To do so, we first establish several useful properties of the run-lengths of a Reed-Muller(1,m) code. Based on the transformation of a code in which a repetition operation becomes an insertion of a zero operation,...
متن کاملOn the Calculation of Generalized Reed-muller Canonical Expansions from Disjoint Cube Representation of Boolean Functions
A new algorithm is shown that converts disjoint cube representation of Boolean functions into fixed-polarity Generalized Reed-Muller Expansions (GRME). Since the known fast algorithm Ihal generates the GRME based on the factorization or thc Reed-Muller transform matrix always starts from the truth table (minterms) of Boolean function, then the described method has the advantages due to smaller ...
متن کاملTransformations amongst the Walsh, Haar, Arithmetic and Reed-Muller Spectral Domains
Direct transformation amongst the Walsh, Haar, Arithmetic and Reed-Muller spectral domains is considered. Matrix based techniques are developed and it is shown that these can be implemented as fast in-place transforms. It is also shown that these transforms can be implemented directly on decision diagram representations.
متن کاملTechniques for dual forms of Reed-Muller expansion conversion
Dual Forms of Reed–Muller (DFRM) are implemented in OR/XNOR forms, which are based on the features of coincidence operation. Map folding and transformation techniques are proposed for the conversion between Boolean and DFRM expansions. However, map techniques can only be used for up to 6 variables. To overcome the limitation, serial tabular technique (STT) and parallel tabular technique (PTT) a...
متن کامل